Bandit Processes and Dynamic Allocation Indices

Bandit Processes and Dynamic Allocation Indices

Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/about/terms.html. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your perso...

Dynamic priority allocation via restless bandit marginal productivity indices

This paper surveys recent work by the author on the theoretical and algorithmic aspects of restless bandit indexation as well as on its application to a variety of problems involving the dynamic allocation of priority to multiple stochastic projects. The main aim is to present ideas and methods in an accessible form that can be of use to researchers addressing problems of such a kind. Besides b...

A New Mechanism of Dynamic Spectrum Access Based on Restless Bandit Allocation Indices

Based on the theory of Restless Multi-Armed Bandit model, a novel mechanism of dynamic spectrum access was proposed for the problem that how to coordinate multi-user access multi-channel which were idle. Firstly, take care of the sensing error must be exist in the practical network, the Whittle index policy which can deal with sensing error effectively was derived, in this policy, the users ach...

An Optimal Dynamic Mechanism for Multi-Armed Bandit Processes

We consider the problem of revenue-optimal dynamic mechanism design in settings where agents’ types evolve over time as a function of their (both public and private) experience with items that are auctioned repeatedly over an infinite horizon. A central question here is understanding what natural restrictions on the environment permit the design of optimal mechanisms (note that even in the simp...

Problem Set 1 . Dynamic Allocation Indices and Information